An optimum scheduling method for multi-option product flows through production lineswithout intermediate buffers
نویسندگان
چکیده
منابع مشابه
Optimum Aggregate Inventory for Scheduling Multi-product Single Machine System with Zero Setup Time
In this paper we adopt the common cycle approach to economic lot scheduling problem and minimize the maximum aggregate inventory. We allow the occurrence of the idle times between any two consecutive products and consider limited capital for investment in inventory. We assume the setup times are negligible. To achieve the optimal investment in inventory we first find the idle times which minimi...
متن کاملAn Improved Optimization Model for Scheduling of a Multi-Product Tree-Like Pipeline
In the petroleum supply chain, oil refined products are often delivered to distribution centers by pipelines since they provide the most reliable and economical mode of transportation over large distances. This paper addresses the optimal scheduling of a complex pipeline network with multiple branching lines. The main challenge is to find the optimal sequence and time of product injections/deli...
متن کاملA multi-objective mathematical model for production-distribution scheduling problem
With increasing competition in the business world and the emergence and development of new technologies, many companies have turned to integrated production and distribution for timely production and delivery at the lowest cost of production and distribution and with the least delay in delivery. By increasing human population and the increase in greenhouse gas emissions and industrial waste, in...
متن کاملHeuristic Method for Optimum Shift Scheduling Design
This paper describes a method to schedule shifts in the most optimum way desire for today’s cost sensitive industries. The main problem for this domain is to make sure all shifts are assigned to cover all or maximum jobs available. The shifts also need to be schedule with the least manpower possible, avoid manpower idling during the shift and take into consideration employee’s time adaptability...
متن کاملAn effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers
In this paper, an effective hybrid discrete differential evolution (HDDE) algorithm is proposed to minimize the maximum completion time (makespan) for a flow shop scheduling problem with intermediate buffers located between two consecutive machines. Different from traditional differential evolution algorithms, the proposed HDDE algorithm adopted job permutation to represent individuals and appl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Management and Production Engineering Review
سال: 2023
ISSN: ['2080-8208', '2082-1344']
DOI: https://doi.org/10.24425/mper.2020.132947